Bipolar orientations Revisited
نویسندگان
چکیده
Acyclic orientations with exactly one source and one sink ~ the so-called bipolar orientations _ arise in many graph algorithms and specially in graph drawing. The fundamental properties of these orientations are explored in terms of circuits, cocircuits and also in terms of “angles” in the planar case. Classical results get here new simple proofs; new results concern the extension of partial orientations, exhaustive enumerations, the existence of deletable and contractable edges, and continuous transitions between bipolar orientations.
منابع مشابه
Iranian EFL Learners’ Motivation Construction: Integrative Motivation Revisited
Although Gardner and his associates’ work was most influential in the field of L2 motivation, from the early 1990s onwards, their work has been criticized for several reasons. Some researchers claimed that integrative and instrumental orientations were no longer able to convey the complexity of the L2 motivation construct. To examine this complexity, the present study attempted to investigate t...
متن کاملOn the Number of α-Orientations
We deal with the enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect matchings and ice models. The notion of an α-orientation unifies many different combinatorial structures, including the afore mentioned. We ask for the number of α-orientations and also for special instances thereof, such as Schny...
متن کاملBaxter permutations and plane bipolar orientations
We present a simple bijection between Baxter permutations of size n and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations (number of ascents, right-to-left maxima, left-to-right minima...) into natural parameters of plane bipolar orientations (number of vertices, degree of the sink, degree of the source...), and has remarkable symmet...
متن کاملBijective counting of plane bipolar orientations
We introduce a bijection between plane bipolar orientations with fixed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with some specific extremities. Writing θij for the number of plane bipolar orientations with (i+1) vertices and (j+1) faces, our bijection provides a combinatorial proof of the following formula due to Baxter: θij = 2 (i+ j − 2)! (i+ j − 1)...
متن کاملBijective counting of plane bipolar orientations and Schnyder woods
A bijection Φ is presented between plane bipolar orientations with prescribed numbers of vertices and faces, and non-intersecting triples of upright lattice paths with prescribed extremities. This yields a combinatorial proof of the following formula due to R. Baxter for the number Θij of plane bipolar orientations with i non-polar vertices and j inner faces: Θij = 2 (i+ j)! (i+ j + 1)! (i + j ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 56 شماره
صفحات -
تاریخ انتشار 1995